Lower bound theorem for normal pseudomanifolds

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower bound theorem for normal pseudomanifolds

In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup’s generalised lower bound conjecture for triangulated spheres in the context of the lower bound theorem. Finally, we pose a new lower bound conjecture for non-simply connected tria...

متن کامل

Lower Bounds for Cubical Pseudomanifolds

It is verified that the number of vertices in a d-dimensional cubical pseudomanifold is at least 2d+1. Using Adin’s cubical h-vector, it is established that the cubical Generalized Lower Bound Conjecture (GLBC) holds for all 4-spheres, as well as some special cases of the cubical GLBC in higher dimensions.

متن کامل

A Lower Bound Theorem

Motivated by Candes and Donoho′s work (Candés, E J, Donoho, D L, Recovering edges in ill-posed inverse problems: optimality of curvelet frames. Ann. Stat. 30, 784-842 (2002)), this paper is devoted to giving a lower bound of minimax mean square errors for Riesz fractional integration transforms and Bessel transforms.

متن کامل

On Normal Stratified Pseudomanifolds

Any pl-stratified pseudomanifod can be normalized preserving its intersection homology. In this paper we extend this result for any topological stratified pseudomanifold and for a family of perversities which is larger than usual. Our construction is functorial. We also give a detailed description of the normalizer’s stratification in terms of the initial stratified pseudomanifold.

متن کامل

An Improved Lower Bound for Folkman’s Theorem

Folkman’s theorem asserts that for each k ∈ N, there exists a natural number n = F (k) such that whenever the elements of [n] are two-coloured, there exists a set A ⊂ [n] of size k with the property that all the sums of the form ∑ x∈B x, where B is a nonempty subset of A, are contained in [n] and have the same colour. In 1989, Erdős and Spencer showed that F (k) ≥ 2ck2/ log , where c > 0 is an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Expositiones Mathematicae

سال: 2008

ISSN: 0723-0869

DOI: 10.1016/j.exmath.2008.06.002